package j2025.j05;

/**
 * @Author 猫大仙
 */
public class j0525 {
    public int findMin(int[] nums) {
        int left = 0, right = nums.length - 1;
        while (left < right) {
            int mid = left + (right - left) / 2;
            if(nums[mid]>nums[nums.length-1]){
                left = mid + 1;
            }else {
                right = mid;
            }
        }
        return nums[left];
    }
}
